Graphs with Strong Proper Connection Numbers and Large Cliques
نویسندگان
چکیده
In this paper, we mainly investigate graphs with a small (strong) proper connection number and large clique number. First, discuss the of graph G order n ω(G)=n−i for 1⩽i⩽3. Next, rainbow n, diam(G)≥3 2⩽i⩽3.
منابع مشابه
Proper connection of graphs
An edge-colored graph G is k-proper connected if every pair of vertices is connected by k internally pairwise vertex-disjoint proper colored paths. The k-proper connection number of a connected graph G, denoted by pck(G), is the smallest number of colors that are needed to color the edges ofG in order tomake it k-proper connected. In this paperweprove several upper bounds for pck(G). We state s...
متن کاملOn various (strong) rainbow connection numbers of graphs
An edge-coloured path is rainbow if all of its edges have distinct colours. For a connected graph G, the rainbow connection number rc(G) of G is the minimum number of colours in an edge-colouring of G such that, any two vertices are connected by a rainbow path. Similarly, the strong rainbow connection number src(G) ofG is the minimum number of colours in an edge-colouring of G such that, any tw...
متن کاملTotal proper connection of graphs
A graph is said to be total-colored if all the edges and the vertices of the graph is colored. A path in a total-colored graph is a total proper path if (i) any two adjacent edges on the path differ in color, (ii) any two internal adjacent vertices on the path differ in color, and (iii) any internal vertex of the path differs in color from its incident edges on the path. A total-colored graph i...
متن کاملUniversal Graphs without Large Cliques
The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....
متن کاملStrong law of large numbers on graphs and groups
We introduce the notion of the mean-set (expectation) of a graph(group-) valued random element ξ and prove a generalization of the strong law of large numbers on graphs and groups. Furthermore, we prove an analogue of the classical Chebyshev’s inequality for ξ. We show that our generalized law of large numbers, as a new theoretical tool, provides a framework for practical applications; namely, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2023
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms12040353